1. Anagram (LeetCode)

1st solution: we had to sort the letters of the input string values
sorting is taxing: 
Time complexity is proportional to n log2(n) with n being the size
of the input strings
Space complexity: is proportion log2(n)

2nd solution:
Time complexity: is proportional to n
Space complexity: is independent of n

s and t consist of lowercase alphabetic characters

sFreqs	tFreqs

hi	ih

a: 0	a: 0
...	...
h: 1	h: 1
i: 1	i: 1
...	...
z: 0	z: 0

String ---> an array of characters: s.toCharArray() ---> char[]
s = "hi" ---> toCharArray ---> ['h', 'i']

2. Two number sum (AlgoExpert)

				target: 5
[1	3	6	10]
		right
left			
Solution#1: nested loops ---> Time complexity: proportional to n^2 where n is the size of the input
array
Solution#2: Sorting the array + using two pointers
---> Time complexity: proportional to n log2(n)

3. Pivot idx (LeetCode)


[1	2	3	0	3]

- In Java, parameters are passed by value.

Application#4: SwappingValue.java

main
val1 = 3, val2 = 4
swap(val1, val2);

swap


val1:add1 ---> 3 <--- val1:add1
val2:add2 ---> 4 <--- val2: add2

int[] arr = {1, 2, 3};
System.out.println(Arrays.toString(arr)); // [1, 2, 3]
System.out.println(arr); // address of 1



